军事安全视角下的军队翻译能力建设

军队翻译能力是军队外语能力的组成部分。军队翻译能力的理论框架包含构成要素、存在形式和转换机制三个组成部分。新的安全形势对我军的翻译保障在广度和深度上都有了新的要求,而军队翻译能力供给相对不足。需要对军队翻译能力进行规划,加强翻译人力资源的储备与管理,提升翻译保障信息化水平。     

潜艇的承载力与水下动力抗沉

阐明了潜艇承载力图谱的一种新算法,分析了危险舵卡的基本挽回方法及其衡准,论述了当前水下动力抗沉的实用方法及评价指标.     

既有锈蚀RC梁剩余抗剪承载力试验

为了准确评估锈蚀RC梁的剩余抗剪承载力,在对6根既有纵筋、箍筋锈蚀都比较严重的混凝土抗弯构件进行了剩余抗剪承力试验研究的基础上,提出了锈蚀RC梁的剩余抗剪承载力计算公式.结果表明,既有锈蚀RC梁挠度曲线没有明显的开裂拐点;破坏时脆性明显,裂缝集中在某一处,间距较大,破坏荷载和屈服荷载接近,受剪破坏形态可能表现为加载点下垂直裂缝引起的破坏.所提出的既有锈蚀RC梁剩余抗剪承载力计算公式与试验结果吻合较好,可为锈蚀RC梁剩余抗剪承载力评估提供一定参考.     

论强化消防部队管理执行力

安全事故频发,引发部队管理危机,究其原因是多方面的,但是,管理中的＂三弱化＂是主因。如何提升管理中的执行力,应从四个方面入手,即强化培训式管理、走动式管理、数字化管理、问责制管理。夯实执行根基,提升执行监管,量化执行标准,重施执行奖惩,确保消防部队管理执行力的提升,是减少安全事故,确保部队高度安全稳定的根本途径。     

军用航空发动机大修能力评估方法

针对航空发动机修理工厂大修能力难以评估的问题,提出了航空发动机大修能力评估方法。分析了航空发动机大修生产过程;根据航空发动机大修生产工作特点,建立了基于生产职能分解的航空发动机大修能力评估指标体系,构建出基于熵权和灰色聚类的评估指标赋权模型;结合实例验证了方法的正确性和实用性。     

神经网络能力研究

文献[1]～[3]中研究了神经网络的能力—存储能力。但我们认为神经网络的能力应包括存储能力和计算能力两个方面。本文对神经网络的存储能力和计算能力进行定量分析,并得出了许多有益的结论。     

高速水射流倒空弹体装药安全性研究

本文阐述了高速水射流倒空弹体装药的机理,建立了确定水射流引爆炸药的临界速度的模拟实验方法和模型,进行了高速水射流冲击炸药的安全性试验,并对试验结果进行了分析,证明在工作泵压下高速水射流倒空弹体装药安全、可靠。     

移动式铁路油罐车清洗装置水循环使用与节能分析

装备节能研究对建设绿色节能型社会具有重要意义。对移动式铁路油罐车清洗装置中清洗管路和吸污管路的热损进行分析计算,提出了水掺混循环使用的节能清洗方案,对清洗工艺中的传热过程、水循环使用中水掺混比例进行了详尽的分析计算,并对节能效果进行了分析。结果表明,清洗管路系统热损较低,水掺混循环使用的节能效果明显。     

Capacity expansion with lead times and autocorrelated random demand

The combination of uncertain demand and lead times for installing capacity creates the risk of shortage during the lead time, which may have serious consequences for a service provider. This paper analyzes a model of capacity expansion with autocorrelated random demand and a fixed lead time for adding capacity. To provide a specified level of service, a discrete time expansion timing policy uses a forecast error‐adjusted minimum threshold level of excess capacity position to trigger an expansion. Under this timing policy, the expansion cost can be minimized by solving a deterministic dynamic program. We study the effects of demand characteristics and the lead time length on the capacity threshold. Autocorrelation acts similarly to randomness in hastening expansions but has a smaller impact, especially when lead times are short. However, the failure either to recognize autocorrelation or to accurately estimate its extent can cause substantial policy errors. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008